Topology Agnostic Bounds on Minimum Requirements for Network Failure Identification
نویسندگان
چکیده
منابع مشابه
New bounds on the minimum calls of failure-tolerant gossiping
Gossiping is an extensively investigated information dissemination process. In gossiping, every vertex holds a message which has to be transmitted to all other vertices. This paper deals with k-failure tolerant gossiping, which investigates the minimum number of transmissions (calls) required by the communication process, provided that at most k transmissions may fail. We show new bounds for th...
متن کاملTight Network Topology Dependent Bounds on Rounds of Communication
We prove tight network topology dependent bounds on the round complexity of computing well studied k-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGESTmodel in distributed computing, we fix the function and then vary the underlying network topology. This complements the recent such results on total communication that have received some attent...
متن کاملTopology agnostic hot-spot avoidance with InfiniBand
InfiniBand has become a very popular interconnect, due to its advanced features and open standard. Large scale InfiniBand clusters are becoming very popular, as reflected by the TOP 500 supercomputer rankings. However, even with popular topologies like constant bi-section bandwidth Fat Tree, hot-spots may occur with InfiniBand, due to inappropriate configuration of network paths, presence of ot...
متن کاملAgnostic System Identification for Monte Carlo Planning
While model-based reinforcement learning is often studied under the assumption that a fully accurate model is contained within the model class, this is rarely true in practice. When the model class may be fundamentally limited, it can be difficult to obtain theoretical guarantees. Under some conditions the DAgger algorithm promises a policy nearly as good as the plan obtained from the most accu...
متن کاملA Framework for Network-Agnostic Multiplayer Games
Producing computer games is a complex and resourceintensive task nowadays. Since this task involves many people with a great variety of expertise, a clear separation of concerns within the project is essential. Especially multiplayer online functionality, which is probably the most popular aspect currently, raises the complexity significantly. Getting this aspect separated allows game developer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2020.3048876